Parallel Adams methods

Parallel Adams methods

In the literature, various types of parallel methods for integrating nonsti initial-value problems for rst-order ordinary di erential equation have been proposed. The greater part of them are based on an implicit multistage method in which the implicit relations are solved by the predictor–corrector (or xed point iteration) method. In the predictor–corrector approach the computation of the comp...

Exponential multistep methods of Adams-type

The paper is concerned with the construction, implementation and numerical analysis of exponential multistep methods. These methods are related to explicit Adams methods but, in contrast to the latter, make direct use of the exponential and related matrix functions of a (possibly rough) linearization of the vector field. This feature enables them to integrate stiff problems explicitly in time. ...

Stability Ordinates of Adams Predictor-Corrector Methods

How far the stability domain of a numerical method for approximating solutions to differential equations extends along the imaginary axis indicates how useful the method is for approximating solutions to wave equations; this maximum extent is termed the stability ordinate, also known as the imaginary stability boundary. It has previously been shown that exactly half of Adams-Bashforth, Adams-Mo...

Implementing Adams Methods with Preassigned Stepsize Ratios

Runge-Kutta and Adams methods are the most popular codes to solve numerically nonstiff ODEs. The Adams methods are useful to reduce the number of function calls, but they usually require more CPU time than the Runge-Kutta methods. In this work we develop a numerical study of a variable step length Adams implementation, which can only take preassigned step-size ratios. Our aim is the reduction o...

Experiments in stepsize control for Adams linear multistep methods